A Verified Optimization Technique to Bound Topological Entropy Rigorously
نویسندگان
چکیده
Our automatic method developed for the detection of chaos is used for finding rigorous lower bounds for the topological entropy of the classical Hénon mapping. We do this within the abstract framework created by Galias and Zgliczynski in 2001, and focus on covering graphs involving different iterations. Our results are compared to those obtained by them.
منابع مشابه
Entropy Estimate for Maps on Forests
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
متن کاملTOPOLOGICAL OPTIMIZATION OF VIBRATING CONTINUUM STRUCTURES FOR OPTIMAL NATURAL EIGENFREQUENCY
Keeping the eigenfrequencies of a structure away from the external excitation frequencies is one of the main goals in the design of vibrating structures in order to avoid risk of resonance. This paper is devoted to the topological design of freely vibrating continuum structures with the aim of maximizing the fundamental eigenfrequency. Since in the process of topology optimization some areas of...
متن کاملEntropy operator for continuous dynamical systems of finite topological entropy
In this paper we introduce the concept of entropy operator for continuous systems of finite topological entropy. It is shown that it generates the Kolmogorov entropy as a special case. If $phi$ is invertible then the entropy operator is bounded with the topological entropy of $phi$ as its norm.
متن کاملOn Verifying Feasibility in Equality Constrained Optimization Problems
Techniques for verifying feasibility of equality constraints are presented. The underlying verification procedures are similar to a proposed algorithm of Hansen, but various possibilities, as well as additional procedures for handling bound constraints, are investigated. The overall scheme differs from some algorithms in that it rigorously verifies exact (rather than approximate) feasibility. T...
متن کاملENTROPY OF GEODESIC FLOWS ON SUBSPACES OF HECKE SURFACE WITH ARITHMETIC CODE
There are dierent ways to code the geodesic flows on surfaces with negative curvature. Such code spaces give a useful tool to verify the dynamical properties of geodesic flows. Here we consider special subspaces of geodesic flows on Hecke surface whose arithmetic codings varies on a set with innite alphabet. Then we will compare the topological complexity of them by computing their topological ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006